Two-dimensional loading in vehicle routing problem with release and due dates

In this paper, we study a two-dimensional vehicle loading and routing problem in which customer orders with deadlines become available for dispatch as per their release dates. The objective is to minimize the sum of transportation, inventory, tardiness costs while respecting various constraints. This scenario allows us tradeoffs that tend arise due temporal order aggregation across We thereby propose an integrated mathematical formulation simultaneously model both requirements at hand. Specifically, NP-hard, scatter search-based heuristic approach solve large-size instances. Further, its performance enhanced using problem-specific procedures strategic oscillation approaches. Additionally, numerical experiments illustrate influence cost structures on optimal configurations along routes. Importantly, our also suggest proposed search method can produce good-quality solutions less time.